SPARQL queries to RDFS views of Topic Maps

نویسندگان

  • Silvia Stefanova
  • Tore Risch
چکیده

Both Topic Maps and RDF are popular semantic web standards designed for machine processing of web documents. Since these representations were originally created for different purposes, they have differences both in their concepts and in their data models. The Topic Map data model can be seen as an ontology for building indices over web documents, whereas RDF is a language to define arbitrary properties of web resources. Ontologies can be defined using the RDF vocabulary description language RDF-Schema (RDFS) language. RDF(S) repositories can be searched using the query language SPARQL. To make Topic Maps exposed to RDF-based tools and searchable with SPARQL, our approach is to map Topic Maps to a view expressed in RDFS. The view can be queried using SPARQL. The problem concerning efficient query processing of SPARQL queries to the rather complex RDF view of Topic Maps has been studied in detail. Our approach has been applied on searching indices to e-government services.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Querying RDF Schema Views of Relational Databases

Petrini, J. 2008. Querying RDF Schema Views of Relational Databases. Acta Universitatis Upsaliensis. Uppsala Dissertations from the Faculty of Science and Technology 75. 117 pp. Uppsala. ISBN 978-91-554-7202-3. The amount of data found on the web today and its lack of semantics makes it increasingly harder to retrieve a particular piece of information. With the Resource Description Framework (R...

متن کامل

Efficient evaluation of SPARQL over RDFS graphs

Evaluating queries over RDFS is currently done by computing the closure, which is quadratic in the worst case. In this paper, we show how to evaluate SPARQL over RDFS graphs by using a navigational language grounded in standard relational algebra with operators for navigating triples with regular constraints. In particular, we show that there is a fragment of this language with linear time data...

متن کامل

An Extension of SPARQL for RDFS

RDF Schema (RDFS) extends RDF with a schema vocabulary with a predefined semantics. Evaluating queries which involve this vocabulary is challenging, and there is not yet consensus in the Semantic Web community on how to define a query language for RDFS. In this paper, we introduce a language for querying RDFS data. This language is obtained by extending SPARQL with nested regular expressions th...

متن کامل

Answering SPARQL queries modulo RDF Schema with paths

SPARQL is the standard query language for RDF graphs. In its strict instantiation, it only offers querying according to the RDF semantics and would thus ignore the semantics of data expressed with respect to (RDF) schemas or (OWL) ontologies. Several extensions to SPARQL have been proposed to query RDF data modulo RDFS, i.e., interpreting the query with RDFS semantics and/or considering externa...

متن کامل

Constrained regular expressions for answering RDF-path queries modulo RDFS

The standard SPARQL query language is currently defined for querying RDF graphs without RDFS semantics. Several extensions to SPARQL have been proposed to query RDF graphs considering RDFS semantics. In this paper, we discuss extensions of SPARQL that uses regular expressions to navigate RDF graphs and may be used to answer queries considering RDFS semantics. In particular, we present and compa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJMSO

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2010